A Framework for Sparse, Non-Linear Least Squares Problems on Manifolds
ثبت نشده
چکیده
Ein Rahmen für dünnbesetzte, nichtlineare quadratische Ausgleichsrechnung auf Mannigfaltigkeiten quthterX rofF hrFEsngF do prese h hrF vutz hröder vorgelegt durhX ghristoph rertzerg niversität fremen xovemer PHHV Acknowledgements pirst of ll s would like to thnk do prese for o'ering me this omplex ut lso interesting nd exiting topiD for the onstrutive disussionsD the mny useful suggestions nd informtionsD s well s for providing me with severl dt sets needed to evlute this thesisF s like to thnk törg uurlum for implementing n erly exmple using this frmeworkD nd his feedk whih led to mny interfe improvementsF purthermore s thnk vutz hröder for volunteering to e the seond reviewer for this thesisF pinlly s thnk my fmily for supporting me during my studies nd during my whole lifeF
منابع مشابه
Sparse Non-linear Least Squares Optimization for Geometric Vision
Several estimation problems in vision involve the minimization of cumulative geometric error using non-linear least-squares fitting. Typically, this error is characterized by the lack of interdependence among certain subgroups of the parameters to be estimated, which leads to minimization problems possessing a sparse structure. Taking advantage of this sparseness during minimization is known to...
متن کاملTensor Methods for Large, Sparse Nonlinear Least Squares Problems
This paper introduces tensor methods for solving large, sparse nonlinear least squares problems where the Jacobian either is analytically available or is computed by nite diier-ence approximations. Tensor methods have been shown to have very good computational performance for small to medium-sized, dense nonlinear least squares problems. In this paper we consider the application of tensor metho...
متن کاملSolving Rank-Deficient Linear Least-Squares Problems*
Numerical solution of linear least-squares problems is a key computational task in science and engineering. Effective algorithms have been developed for the linear least-squares problems in which the underlying matrices have full rank and are well-conditioned. However, there are few efficient and robust approaches to solving the linear least-squares problems in which the underlying matrices are...
متن کاملA Projected Alternating Least square Approach for Computation of Nonnegative Matrix Factorization
Nonnegative matrix factorization (NMF) is a common method in data mining that have been used in different applications as a dimension reduction, classification or clustering method. Methods in alternating least square (ALS) approach usually used to solve this non-convex minimization problem. At each step of ALS algorithms two convex least square problems should be solved, which causes high com...
متن کاملA deficient-basis dual counterpart of Paparrizos, Samaras and Stephanides' primal-dual simplex-type algorithm
In a recent primal-dual simplex-type algorithm [K. Paparrizos, N. Samaras and G. Stephanides, 2003, A new efficient primal dual simplex algorithm. Computers & Operations Research 30, 1383–1399], their authors show how to take advantage of the knowledge of a primal feasible point and they work with a square basis during the whole process. In this paper we address what could be thought of as its ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008